Time-optimal trajectories of generic control-affine systems have at worst iterated Fuller singularities
نویسندگان
چکیده
منابع مشابه
Optimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملSingular Trajectories of Control-Affine Systems
When applying methods of optimal control to motion planning or stabilization problems, some theoretical or numerical difficulties may arise, due to the presence of specific trajectories, namely, singular minimizing trajectories of the underlying optimal control problem. In this article, we provide characterizations for singular trajectories of control-affine systems. We prove that, under generi...
متن کاملOptimal control of linear fuzzy time-variant controlled systems
In this paper, we study linear fuzzy time-variant optimal control systems using the generalized differentiability concept and we present the general form of optimal controls and states. Some examples are provided to illustrate our results.
متن کاملDecentralized Adaptive Control of Large-Scale Non-affine Nonlinear Time-Delay Systems Using Neural Networks
In this paper, a decentralized adaptive neural controller is proposed for a class of large-scale nonlinear systems with unknown nonlinear, non-affine subsystems and unknown nonlinear time-delay interconnections. The stability of the closed loop system is guaranteed through Lyapunov-Krasovskii stability analysis. Simulation results are provided to show the effectiveness of the proposed approache...
متن کاملWorst-Case Optimal Join at a Time
Joins are at the core of database systems, yet worst-case optimal join algorithms have been developed only recently. At the outset of this effort is the observation that the standard join plans are suboptimal as their intermediate results may be larger than the final result. To attain worst-case optimality, new join algorithms are monolithic and thus avoid intermediate results. The conceptual c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré C, Analyse non linéaire
سال: 2019
ISSN: 0294-1449
DOI: 10.1016/j.anihpc.2018.05.005